package com.example.leetcode.slidingwindow;

import com.example.leetcode.slidingwindow.common.SlidingWindowUtils;

class Solution487 {
    public int findMaxConsecutiveOnes(int[] nums) {
//        return SlidingWindowUtils.findMaxConsecutiveOnes2(nums);
        return SlidingWindowUtils.findMaxConsecutiveOnes3(nums);
    }
}

public class leetcode487 {
    public static void main(String[] args) {
        Solution487 solution487 = new Solution487();
        int[] nums = {1, 0, 1, 1, 0};
        int[] nums1 = {1, 0};
        int[] nums2 = {1};
        int[] nums3 = {0};
        System.out.println(solution487.findMaxConsecutiveOnes(nums));
        System.out.println(solution487.findMaxConsecutiveOnes(nums1));
        System.out.println(solution487.findMaxConsecutiveOnes(nums2));
        System.out.println(solution487.findMaxConsecutiveOnes(nums3));
    }
}
